Accelerating Primal Solution Findings for Mixed Integer Programs Based on Solution Prediction
نویسندگان
چکیده
منابع مشابه
A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions
In this paper a new methodology is developed for the solution of mixed-integer nonlinear programs under uncertainty whose problem formulation is complicated by both noisy variables and black-box functions representing a lack of model equations. A branchand-bound framework is employed to handle the integer complexity whereby the solution to the relaxed nonlinear program subproblem at each node i...
متن کاملA decomposition-based solution method for stochastic mixed integer nonlinear programs
This is a summary of the main results presented in the author’s PhD thesis, supervised by D. Conforti and P. Beraldi and defended on March 2005. The thesis, written in English, is available from the author upon request. It describes one of the very few existing implementations of a method for solving stochastic mixed integer nonlinear programming problems based on deterministic global optimizat...
متن کاملA Solution Approach for Two-Stage Stochastic Nonlinear Mixed Integer Programs
This paper addresses the class of nonlinear mixed integer stochastic programming problems. In particular, we consider two-stage problems with nonlinearities both in the objective function and constraints, pure integer first stage and mixed integer second stage variables. We exploit the specific problem structure to develop a global optimization algorithm. The basic idea is to decompose the orig...
متن کاملPredicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs
T most widely used progress measure for branch-and-bound (B&B) algorithms when solving mixed-integer programs (MIPs) is the MIP gap. We introduce a new progress measure that is often much smoother than the MIP gap. We propose a double exponential smoothing technique to predict the solution time of B&B algorithms and evaluate the prediction method using three MIP solvers. Our computational exper...
متن کاملStructure-based primal heuristics for mixed integer programming
Primal heuristics play an important role in the solving of mixed integer programs (MIPs). They help to reach optimality faster and provide good feasible solutions early in the solving process. In this paper, we present two new primal heuristics which take into account global structures available within MIP solvers to construct feasible solutions at the beginning of the solving process. These he...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2020
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v34i02.5503